Interval hash tree: An eÆcient index structure for searching object queries in large image databases
نویسنده
چکیده
As image databases grow large in size, index structures for fast navigation become important. In particular, when the goal is to lo cate obje ct queries in image datab ases under changes in pose, occlusions and spurious data, traditional index structures used in databases become unsuitable. This paper presents a novel index structur e called the interval hash tree, for lo cating multi-region obje ct queries in image databases. The utility of the index structure is demonstrated for query localization in a large image database.
منابع مشابه
Sequential and Mapreduce-based Algorithms for Constructing an In-place Multidimensional Quad-tree Index for Answering Fixed-radius Nearest Neighbor Queries
Answering fixed-radius nearest neighbor queries constitutes an important problem in many areas, ranging from geographic systems to similarity searching in object databases (e.g. image and video databases). The usual approach in order to efficiently answer such queries is to construct an index. In this paper we present algorithms for constructing a multidimensional quad-tree index. We start with...
متن کاملA Model of Image Representation and Indexing in Image Database Systems
Image database systems need to be built to support eeective and eecient access to image data on the basis of content. In this process, signiicant features must rst be extracted from image data in their pixel format. These features must then be classiied and indexed to assist eecient retrieval of image content. However, the issues central to automatic extraction and indexing of image content rem...
متن کاملObject-Based Classification of UltraCamD Imagery for Identification of Tree Species in the Mixed Planted Forest
This study is a contribution to assess the high resolution digital aerial imagery for semi-automatic analysis of tree species identification. To maximize the benefit of such data, the object-based classification was conducted in a mixed forest plantation. Two subsets of an UltraCam D image were geometrically corrected using aero-triangulation method. Some appropriate transformations were perfor...
متن کاملEfficient Spatial Indexes for Approximate Range Searching
Building efficient spatial indexes for range searching is a central problem in spatial databases. The R-tree has been a popular spatial index thanks to its simplicity, ability to answer various queries, and the flexibility to store spatial objects of different shapes. However, the R-tree is known to be a heuristic-based structure and no guarantees can be made on its query performance. In this p...
متن کاملRobust Audio Hashing for Content Identification
Nowadays most audio content identification systems are based on watermarking technology. In this paper we present a different technology, referred to as robust audio hashing. By extracting robust features and translating them into a bit string, we get an object called a robust hash. Content can then be identified by comparing hash values of a received audio clip with the hash values of previous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009